Products of Circulant Graphs Are Metacirculant

نویسنده

  • Robin S. Sanders
چکیده

The standard products—cartesian, lexicographic, tensor, and strong—all belong to a class of products introduced by W. Imrich and H. Izbicki (1975, Monatsh. Math. 80, 277–281) and later called B-products by I. Broere and J. H. Hattingh (1990, Quaest. Math. 13, 191–216) who establish that the lexicographic product of two circulant graphs is again circulant. In this paper, we establish that any B-product of two circulant graphs is always a so-called metacirculant graph with parameters that are easily described in terms of the product graphs. We also establish that any metacirculant graph with the appropriate structure is isomorphic to the B-product of a pair of circulant graphs. © 2002 Elsevier Science (USA)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak metacirculants of odd prime power order

Metacirculants are a basic and well-studied family of vertex-transitive graphs, and weak metacirculants are generalizations of them. A graph is called a weak metacirculant if it has a vertex-transitive metacyclic automorphism group. This paper is devoted to the study of weak metacirculants with odd prime power order. We first prove that a weak metacirculant of odd prime power order is a metacir...

متن کامل

2 0 Ju l 1 99 9 When is a Tensor Product of Circulant Graphs Circulant ?

The tensor product, also called direct, categorical, or Kronecker product of graphs, is one of the least-understood graph products. In this paper we determine partial answers to the question given in the title, thereby significantly extending results of Broere and Hattingh (see [2]). We characterize completely those pairs of complete graphs whose tensor products are circulant. We establish that...

متن کامل

On the isomorphism problem for a family of cubic metacirculant graphs

In this paper an isomorphism testing algorithm for graphs in the family of all cubic metacirculant graphs with non-empty first symbol So is given. The time complexity of this algorithm is also evaluated.

متن کامل

Efficient domination in circulant graphs

Results about wreath products of circulant graphs are used to construct infinitely many circulant graphswith efficient dominating setswhose elements need not be equally spaced in Zn. It is proved that if a circulant graph of large degree has an efficient dominating set, then either its elements are equally spaced, or the graph is the wreath product of a smaller circulant graph with an efficient...

متن کامل

On Hamilton cycles in cubic (m, n)-metacirculant graphs, II

continue to investigate the problem of the existence of a Hamilton connected cubic (m,n)-metacirculant graphs. We show that a connected cubic (m,n)-metacirculant graph G = MC(m, n, a, So, ,.., has Hamilton cycle if either a 2 == 1 (mod n) or in the case of an odd number f.L one of the numbers (a 1) or a + a 2 _ ... ajJ.-2 + ajJ.-l) relatively to n. As a corollary of results we obtain that every...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 85  شماره 

صفحات  -

تاریخ انتشار 2002